Efficient Approximation for Restricted Biclique Cover Problems
نویسندگان
چکیده
منابع مشابه
Chromatic Characterization of Biclique Cover
A biclique B of a simple graph G is the edge-set of a complete bipartite (not necessarily induced) subgraph of G. A biclique cover of G is a collection of bicliques covering the edgeset of G. Given a graph G, we will study the following problem: find the minimum number of bicliques which cover the edge-set of G. This problem will be called the minimum biclique cover problem (MBC). First, we wil...
متن کاملBiclique Edge Cover Graphs and Confluent Drawings
Confluent drawing is a technique that allows some non-planar graphs to be visualized in a planar way. This approach merges edges together, drawing groups of them as single tracks, similar to train tracks. In the general case, producing confluent drawings automatically has proven quite difficult. We introduce the biclique edge cover graph that represents a graph G as an interconnected set of cli...
متن کاملSome new bounds for cover-free families through biclique covers
An (r, w; d) cover-free family (CFF ) is a family of subsets of a finite set such that the intersection of any r members of the family contains at least d elements that are not in the union of any other w members. The minimum number of elements for which there exists an (r, w; d) − CFF with t blocks is denoted by N((r, w; d), t). In this paper, we show that the value of N((r, w; d), t) is equal...
متن کاملAlgorithms for induced biclique optimization problems
We present polynomial time algorithms for induced biclique optimization problems in the following families of graphs: polygon-circle graphs, 4-hole-free graphs, complements of intervalfilament graphs and complements of subtree-filament graphs. Such problems are to find maximum: induced bicliques, induced balanced bicliques and induced edge bicliques. These problems have applications for bicliqu...
متن کاملApproximation Algorithms for Edge Partitioned Vertex Cover Problems
We consider a natural generalization of the Partial Vertex Cover problem. Here an instance consists of a graph G = (V,E), a cost function c : V → Z, a partition P1, . . . , Pr of the edge set E, and a parameter ki for each partition Pi. The goal is to find a minimum cost set of vertices which cover at least ki edges from the partition Pi. We call this the Partition-VC problem. In this paper, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2018
ISSN: 1999-4893
DOI: 10.3390/a11060084